Solving High-Order Portfolios via Successive Convex Approximation Algorithms
نویسندگان
چکیده
The first moment and second central moments of the portfolio return, a.k.a. mean variance, have been widely employed to assess expected profit risk portfolio. Investors pursue higher lower variance when designing portfolios. two can well describe distribution return it follows Gaussian distribution. However, real world assets is usually asymmetric heavy-tailed, which far from being a asymmetry heavy-tailedness are characterized by third fourth moments, i.e., skewness kurtosis, respectively. Higher kurtosis preferred reduce probability extreme losses. incorporating high-order in design very difficult due their non-convexity rapidly increasing computational cost with dimension. In this paper, we propose efficient convergence-provable algorithm framework based on successive convex approximation (SCA) solve efficiency proposed demonstrated numerical experiments.
منابع مشابه
Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization
This paper proposes a constrained stochastic successive convex approximation (CSSCA) algorithm to find a stationary point for a general non-convex stochastic optimization problem, whose objective and constraint functions are nonconvex and involve expectations over random states. The existing methods for non-convex stochastic optimization, such as the stochastic (average) gradient and stochastic...
متن کاملNumerical approximation based on the Bernouli polynomials for solving Volterra integro-differential equations of high order
In this article, an applied matrix method, which is based on Bernouli Polynomials, has been presented to find approximate solutions of high order Volterra integro-differential equations. Through utilizing this approach, the proposed equations reduce to a system of algebric equations with unknown Bernouli coefficients. A number of numerical illustrations have been solved to assert...
متن کاملA Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملParallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization
Consider the problem of minimizing the sum of a smooth (possibly non-convex) and a convex (possibly nonsmooth) function involving a large number of variables. A popular approach to solve this problem is the block coordinate descent (BCD) method whereby at each iteration only one variable block is updated while the remaining variables are held fixed. With the recent advances in the developments ...
متن کاملHigh-order algorithms for solving eigenproblems over discrete surfaces
The eigenvalue problem of the Laplace-Beltrami operators on curved surfaces plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial differential equations which involve this operator. In this note we shall combine the local tangential lifting (LTL) method with the configuration equation to develop a new effective and convergent algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2021
ISSN: ['1053-587X', '1941-0476']
DOI: https://doi.org/10.1109/tsp.2021.3051369